Improved algorithms for the K overlapping maximum convex sum problem
نویسندگان
چکیده
منابع مشابه
Efficient Algorithms for the Maximum Convex Sum Problem
his research is designed to develop and investigate newly defined problems: the Maximum Convex Sum (MCS), and its generalisation, the K-Maximum Convex Sum (K-MCS), in a two-dimensional (2D) array based on dynamic programming. The study centres on the concept of finding the most useful informative array portion as defined by different parameters involved in data, which is generically expressed i...
متن کاملImproved Algorithms for the K-Maximum Subarray Problem
Themaximum subarray problem is to find the contiguous array elements having the largest possible sum. We extend this problem to find K maximum subarrays. For general K maximum subarrays where overlapping is allowed, Bengtsson and Chen presented OðminfK + n logn‚ n ffiffiffiffi K p gÞ time algorithm for one-dimensional case, which finds unsorted subarrays. Our algorithm finds K maximum subarrays...
متن کاملEfficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem
Given a sequence of n real numbers A = a1, a2, . . . , an and a positive integer k, the Sum Selection Problem is to find the segment A(i, j) = ai, ai+1, . . . , aj such that the rank of the sum s(i, j) = j t=i at is k over all n(n−1) 2 segments. We present a deterministic algorithm for this problem that runs in O(n log n) time. The previously best known randomized algorithm for this problem run...
متن کاملImproved Algorithms for the K-Maximum Subarray Problem for Small K
The maximum subarray problem for a oneor two-dimensional array is to find the array portion that maiximizes the sum of array elements in it. The K-maximum subarray problem is to find the K subarrays with largest sums. We improve the time complexity for the one-dimensional case from O(min{K + n log n, n √ K}) for 0 ≤ K ≤ n(n − 1)/2 to O(n logK + K) for K ≤ n. The latter is better when K ≤ √n log...
متن کاملOptimal algorithms for the average-constrained maximum-sum segment problem
a r t i c l e i n f o a b s t r a c t Given a real number sequence A = (a 1 , a 2 ,. .. ,a n), an average lower bound L, and an average upper bound U , the Average-Constrained Maximum-Sum Segment problem is to locate a segment A(i, j) = (a i , a i+1 ,. .. ,a j) that maximizes ik j a k subject to L (ik j a k)/(j − i + 1) U. In this paper, we give an O (n)-time algorithm for the case where the av...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2012
ISSN: 1877-0509
DOI: 10.1016/j.procs.2012.04.081